A simple algorithm for despiking Raman spectra
نویسندگان
چکیده
منابع مشابه
Automatic Spike Removal Algorithm for Raman Spectra.
Raman spectroscopy is a powerful technique, widely used in both academia and industry. In part, the technique's extensive use stems from its ability to uniquely identify and image various material parameters: composition, strain, temperature, lattice/excitation symmetry, and magnetism in bulk, nano, solid, and organic materials. However, in nanomaterials and samples with low thermal conductivit...
متن کاملFT-Raman Spectra of Saffron (Crocus Stivus L.); A Possible Method for Standardization of Saffron
FT-Raman Spectra of Saffron (crocus sativus L.) with a partial assignment is reported. Based on the Raman data, it is concluded that main pigments in saffron are crocins and crocetin. It is proposed that the quickly attainable FT-Raman spectrum of solid saffron, may be used as a means of saffron standardization.
متن کاملOptimal Feature Extraction for Discriminating Raman Spectra of Different Skin Samples using Statistical Methods and Genetic Algorithm
Introduction: Raman spectroscopy, that is a spectroscopic technique based on inelastic scattering of monochromatic light, can provide valuable information about molecular vibrations, so using this technique we can study molecular changes in a sample. Material and Methods: In this research, 153 Raman spectra obtained from normal and dried skin samples. Baseline and electrical noise were eliminat...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemometrics and Intelligent Laboratory Systems
سال: 2018
ISSN: 0169-7439
DOI: 10.1016/j.chemolab.2018.06.009